On Commuting Outimized Intmt Probabilities for Random Tests
نویسنده
چکیده
Self testing of integrated circuits by random patterns has several technical and economical advantages. But there exists a large number of circuits which cannot be randomly tested, since the fault coverage achieved that way would be too low. In this paper we show that this problem can be solved by unequiprobable random patterns, and an efficient procedure is presented compu ting the specific optimal probability for each primary input of a combinational network.
منابع مشابه
A Note on Commutes and the Spatial Mismatch Hypothesis
A number of empirical studies have tested the spatial mismatch hypothesis by examining the commuting times of blacks and whites. This note points out that the link between spatial mismatch and commuting times may be weak when employment probabilities decline as the distance from job site to residence increases. A simple spatial model of urban employment is developed in which a fixed number of a...
متن کاملRelative n-th non-commuting graphs of finite groups
Suppose $n$ is a fixed positive integer. We introduce the relative n-th non-commuting graph $Gamma^{n} _{H,G}$, associated to the non-abelian subgroup $H$ of group $G$. The vertex set is $Gsetminus C^n_{H,G}$ in which $C^n_{H,G} = {xin G : [x,y^{n}]=1 mbox{~and~} [x^{n},y]=1mbox{~for~all~} yin H}$. Moreover, ${x,y}$ is an edge if $x$ or $y$ belong to $H$ and $xy^{n}eq y^{n}x$ or $x...
متن کاملCommuting probability for subrings and quotient rings
We prove that the commuting probability of a finite ring is no larger than the commuting probabilities of its subrings and quotients, and characterize when equality occurs in such a comparison.
متن کاملOn the Diameters of Commuting Graphs Arising from Random Skew-Symmetric Matrices
We present a two-parameter family (Gm,k)m,k∈N≥2 , of finite, non-abelian random groups and propose that, for each fixed k, as m → ∞ the commuting graph of Gm,k is almost surely connected and of diameter k. We present heuristic arguments in favour of this conjecture, following the lines of classical arguments for the Erdős– Rényi random graph. As well as being of independent interest, our groups...
متن کاملCommuting Birth-and-death Processes
We use methods from combinatorics and algebraic statistics to study analogues of birth-and-death processes that have as their state space a finite subset of the m-dimensional lattice and for which the m matrices that record the transition probabilities in each of the lattice directions commute pairwise. One reason such processes are of interest is that the transition matrix is straightforward t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015